Semidefinite Embedding Applied to Visualizing Folksonomies CS6772 Project Proposal
نویسنده
چکیده
This paper investigates using Semidefinite Embedding (SDE) to visualize data collected from a folksonomy. The del.icio.us social bookmarking service is a perfect example of a folksonomy; a community of users label websites with descriptive tags. Each tag exists in a high-dimensional space corresponding to the frequency of use of that tag among all the users of the system. We are motivated by the following question: can we find a simple low-dimensional structure for these tags that captures the significant relationships inherent in the data? In this paper we explore Semidefinite Embedding, an algorithm for non-linear dimensionality reduction, and its application to visualizing folksonomic systems, focusing on the effects of specifying different levels of connectivity for the data and the heuristics which can be used to find the best parameters for the algorithm.
منابع مشابه
Visualizing pairwise similarity via semidefinite programming
We introduce a novel learning algorithm for binary pairwise similarity measurements on a set of objects. The algorithm delivers an embedding of the objects into a vector representation space that strictly respects the known similarities, in the sense that objects known to be similar are always closer in the embedding than those known to be dissimilar. Subject to this constraint, our method sele...
متن کاملVisualizing Graphs with Structure Preserving Embedding
Structure Preserving Embedding (SPE) is a method for embedding graphs in lowdimensional Euclidean space such that the embedding preserves the graph’s global topological properties. Specifically, topology is preserved if a connectivity algorithm can recover the original graph from only the coordinates of its nodes after embedding. Given an input graph and an algorithm for linking embedded nodes,...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملPhD proposal
In this proposal I’d like to present my idea and vision of a possible PhD project in the fields of computer science. First, the reader is introduced into the topic. Then, a short sketch of the project is drawn. Furthermore, I want to complete this proposal by giving some reasons concerning non-technical challenges for embedding this PhD into an interdisciplinary environment within the research ...
متن کاملTowards Ontological Structures Extraction from Folksonomies: An Efficient Fuzzy Clustering Approach
Folksonomies are one of the technologies of Web 2.0 that permit users to annotate resources on the Web. In this paper, the authors propose an integrated approach to extract ontological structures from unstructured and semi-structured resources. Our proposal overcomes limitations of existing approaches. It gives a formal, simple, and efficient solution to the tag clustering and disambiguation pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005